Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
نویسندگان
چکیده
منابع مشابه
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
We consider the feasibility model of multi-agent scheduling on a single machine, where each agent’s objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first show that the problem can be solved in pseudo-polynomial time for integral weights, and can be solved in polynomial ...
متن کاملA Survey of Single Machine Scheduling to Minimize Weighted Number of Tardy Jobs
This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time pj and due date dj . The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job j is Cj > dj and on-time otherwise. This paper assesses works done to minimize the...
متن کاملBatch scheduling to minimize the weighted number of tardy jobs
In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within a family. 2007 Elsevier Ltd. All rights reserved.
متن کاملMetaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs
This paper considers the scheduling of n jobs on m parallel machines to minimize the weighted number of early and tardy jobs. The single machine case of this problem has been shown to be NPcomplete in the strong sense. This problem on m parallel machine is also NP complete in the strong sense and finding an optimal solution appears unlikely. The problem is formulated as an integer linear progra...
متن کاملSingle-machine scheduling to minimize absolute lateness for a specified number of tardy jobs
We consider the problem of common due-date to of simultaneously available jobs and sequencing them on a that a number of the jobs are tardy. The optimal combination of the common due-date and job sequence that minimizes the total absolute lateness. A simple to achieve this. Effectively three independent procedures : one to the nnT,nn<>1 sequence; a second to the optimal due date and a third to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.07.011